Block Sensitivity of Weakly Symmetric Functions
نویسنده
چکیده
Block sensitivity, which was introduced by Nisan [5], is one of the most useful measures of boolean functions. In this paper we investigate the block sensitivity of weakly symmetric functions (functions invariant under some transitive group action). We prove a Ω(N) lower bound for the block sensitivity of weakly symmetric functions. We also construct a weakly symmetric function which has block sensitivity Õ(N).
منابع مشابه
ON THE FUNCTION OF BLOCK ANTI DIAGONAL MATRICES AND ITS APPLICATION
The matrix functions appear in several applications in engineering and sciences. The computation of these functions almost involved complicated theory. Thus, improving the concept theoretically seems unavoidable to obtain some new relations and algorithms for evaluating these functions. The aim of this paper is proposing some new reciprocal for the function of block anti diagonal matrices. More...
متن کاملWavelet-based numerical method for solving fractional integro-differential equation with a weakly singular kernel
This paper describes and compares application of wavelet basis and Block-Pulse functions (BPFs) for solving fractional integro-differential equation (FIDE) with a weakly singular kernel. First, a collocation method based on Haar wavelets (HW), Legendre wavelet (LW), Chebyshev wavelets (CHW), second kind Chebyshev wavelets (SKCHW), Cos and Sin wavelets (CASW) and BPFs are presented f...
متن کاملOn weakly e*-open and weakly e*-closed Functions
The aim of this paper is to introduce and study two new classes of functions called weakly $e^{*}$-open functions and weakly $e^{*}$-closed functions via the concept of $e^{*}$-open set defined by Ekici cite{erd1}. The notions of weakly $e^{*}$-open and weakly $e^{*}$-closed functions are weaker than the notions of weakly $beta$-open and weakly $beta$-closed functions defined by Caldas and Nava...
متن کاملOn the Sensitivity Conjecture for Read-k Formulas
Various combinatorial/algebraic parameters are used to quantify the complexity of a Boolean function. Among them, sensitivity is one of the simplest and block sensitivity is one of the most useful. Nisan (1989) and Nisan and Szegedy (1991) showed that block sensitivity and several other parameters, such as certificate complexity, decision tree depth, and degree over R, are all polynomially rela...
متن کاملOn characterizations of weakly $e$-irresolute functions
The aim of this paper is to introduce and obtain some characterizations of weakly $e$-irresolute functions by means of $e$-open sets defined by Ekici [6]. Also, we look into further properties relationships between weak $e$-irresoluteness and separation axioms and completely $e$-closed graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 384 شماره
صفحات -
تاریخ انتشار 2006